Singularities in Negami’s splitting formula for the Tutte polynomial

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Convolution Formula for the Tutte Polynomial

Let M be a finite matroid with rank function r. We will write A M when we mean that A is a subset of the ground set of M, and write M|A and M A for the matroids obtained by restricting M to A and contracting M on A respectively. Let M* denote the dual matroid to M. (See [1] for definitions). The main theorem is Theorem 1. The Tutte polynomial TM(x, y) satisfies TM(x, y)= : A M TM|A(0, y) TM A(x...

متن کامل

1 99 7 a Convolution Formula for the Tutte Polynomial

Let M be a finite matroid with rank function r. We will write A ⊆ M when we mean that A is a subset of the ground set of M , and write M | A and M/A for the matroids obtained by restricting M to A, and contracting M on A respectively. Let M * denote the dual matroid to M. (See [1] for definitions). The main theorem is Theorem 1. The Tutte polynomial T M (x, y) satisfies (1) T M (x, y) = A⊆M T M...

متن کامل

On the tutte polynomial of benzenoid chains

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

متن کامل

Splitting Formulas for Tutte Polynomials

We present two splitting formulas for calculating the Tutte polynomial of a matroid. The rst one is for a generalized parallel connection across a 3-point line of two matroids and the second one is applicable to a 3-sum of two matroids. An important tool used is the bipointed Tutte polynomial of a matroid, an extension of the pointed Tutte polynomial introduced by Thomas Brylawski in Bry71].

متن کامل

The Tutte polynomial

This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2018

ISSN: 0166-218X

DOI: 10.1016/j.dam.2017.11.021